Higher-order port-graph rewriting

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher-order port-graph rewriting

The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper we add higher-order features to the original port-graph syntax, along with a generalised notion of graph morphism. We provide a matching algorith...

متن کامل

A Generic Tool for Higher-Order Term Graph Rewriting

This thesis contains a study of Curry-Howard correspondences for Sequent Calculus formulations of Classical Logic. Starting from Gentzen’s formal definition of logical consequence (presented in the framework of his sequent calculus), we present an automated process to conservatively extend the framework with primitive logical connectives and corresponding cut-elimination rules. The key difficul...

متن کامل

Higher-Order Rewriting

Note: This paper will appear in the proceedings of the 10th international conference on rewriting techniques and applications (RTA'99). c Springer Verlag.

متن کامل

Strategic Port Graph Rewriting for Autonomic Computing

In this paper, we present a high-level formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We show that this formalism is suitable for modeling autonomic systems and we illustrate its expressivity for modeling properties of such systems using an example of a mail delivery system.

متن کامل

Residuals in Higher-Order Rewriting

Residuals have been studied for various forms of rewriting and residual systems have been defined to capture residuals in an abstract setting. In this article we study residuals in orthogonal Pattern Rewriting Systems (PRSs). First, the rewrite relation is defined by means of a higher-order rewriting logic, and proof terms are defined that witness reductions. Then, we have the formal machinery ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2012

ISSN: 2075-2180

DOI: 10.4204/eptcs.101.3